A Data-Driven Multistage Adaptive Robust Optimization Framework for Planning and Scheduling under Uncertainty
نویسندگان
چکیده
A novel data-driven approach for optimization under uncertainty based on multistage adaptive robust optimization (ARO) and nonparametric kernel density M-estimation is proposed. Different from conventional robust optimization methods, the proposed framework incorporates distributional information to avoid over-conservatism. Robust kernel density estimation with Hampel loss function is employed to extract probability distributions from uncertainty data via a kernelized iteratively reweighted least squares algorithm. A data-driven uncertainty set is proposed, where bounds of uncertain parameters are defined by quantile functions, to organically integrate the multistage ARO framework with uncertainty data. Based on this uncertainty set, we further develop an exact robust counterpart in its general form for solving the resulting data-driven multistage ARO problem. To illustrate the applicability of the proposed framework, two typical applications in process operations are presented: The first one is on strategic planning of process networks, and the other one on short-term scheduling of multipurpose batch processes. The proposed approach returns 23.9% higher net present value and 31.5% more profits than the conventional robust optimization method in planning and scheduling applications, respectively.VC 2017 American Institute of Chemical Engineers AIChE J, 00: 000–000, 2017
منابع مشابه
Robust production scheduling in open-pit mining under uncertainty: a box counterpart approach
Open-Pit Production Scheduling (OPPS) problem focuses on determining a block sequencing and scheduling to maximize Net Present Value (NPV) of the venture under constraints. The scheduling model is critically sensitive to the economic value volatility of block, block weight, and operational capacity. In order to deal with the OPPS uncertainties, various approaches can be recommended. Robust opti...
متن کاملData-Driven Stochastic Robust Optimization: General Computational Framework and Algorithm Leveraging Machine Learning for Optimization under Uncertainty in the Big Data Era
A novel data-driven stochastic robust optimization (DDSRO) framework is proposed for optimization under uncertainty leveraging labeled multi-class uncertainty data. Uncertainty data in large datasets are often collected from various conditions, which are encoded by class labels. Machine learning methods including Dirichlet process mixture model and maximum likelihood estimation are employed for...
متن کاملAdaptable optimization: theory and algorithms
Optimization under uncertainty is a central ingredient for analyzing and designing systems with incomplete information. This thesis addresses uncertainty in optimization, in a dynamic framework where information is revealed sequentially, and future decisions are adaptable, i.e., they depend functionally on the information revealed in the past. Such problems arise in applications where actions a...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملDiscrete time robust control of robot manipulators in the task space using adaptive fuzzy estimator
This paper presents a discrete-time robust control for electrically driven robot manipulators in the task space. A novel discrete-time model-free control law is proposed by employing an adaptive fuzzy estimator for the compensation of the uncertainty including model uncertainty, external disturbances and discretization error. Parameters of the fuzzy estimator are adapted to minimize the estimat...
متن کامل